Trigonometric Expressions for Fibonacci and Lucas Numbers
نویسنده
چکیده
The amount of literature bears witness to the ubiquity of the Fibonacci numbers and the Lucas numbers. Not only these numbers are popular in expository literature because of their beautiful properties, but also the fact that they ‘occur in nature’ adds to their fascination. Our purpose is to use a certain polynomial identity to express these numbers in terms of trigonometric functions. It is interesting that these expressions provide natural proofs of old and new divisibility properties for the Fibonacci numbers. One can naturally recover some divisibility properties and discover/observe some others which seem to be new. There are some fascinating open questions about the periodicity of the Fibonacci sequences modulo primes and we shall also prove some partial results on this.
منابع مشابه
Some Trigonometric Identities Involving Fibonacci and Lucas Numbers
In this paper, using the number of spanning trees in some classes of graphs, we prove the identities: Fn = 2n−1 n √
متن کاملThe (non-)existence of perfect codes in Lucas cubes
A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...
متن کاملIdentities Involving Lucas or Fibonacci and Lucas Numbers as Binomial Sums
As in [1, 2], for rapid numerical calculations of identities pertaining to Lucas or both Fibonacci and Lucas numbers we present each identity as a binomial sum. 1. Preliminaries The two most well-known linear homogeneous recurrence relations of order two with constant coefficients are those that define Fibonacci and Lucas numbers (or Fibonacci and Lucas sequences). They are defined recursively ...
متن کاملON THE GENERALIZED ORDER-k FIBONACCI AND LUCAS NUMBERS
In this paper we consider the generalized order-k Fibonacci and Lucas numbers. We give the generalized Binet formula, combinatorial representation and some relations involving the generalized order-k Fibonacci and Lucas numbers.
متن کاملOn the Fibonacci and Lucas p-numbers, their sums, families of bipartite graphs and permanents of certain matrices
In this paper we consider certain generalizations of the well-known Fibonacci and Lucas numbers, the generalized Fibonacci and Lucas p-numbers. We give relationships between the generalized Fibonacci p-numbers, Fp(n), and their sums, Pn i1⁄41F pðiÞ, and the 1-factors of a class of bipartite graphs. Further we determine certain matrices whose permanents generate the Lucas p-numbers and their sum...
متن کامل